Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar14/HMSLASHn005.trs

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

f₁(x) -> f₁(f₁(x))

Q is empty.

↳ QTRS

  ↳ Non-Overlap Check

Q restricted rewrite system:
The TRS R consists of the following rules:

f₁(x) -> f₁(f₁(x))

Q is empty.

The TRS is non-overlapping. Hence, we can switch to innermost.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f₁(x) -> f₁(f₁(x))

The set Q consists of the following terms:

f₁(x0)

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

F₁(x) -> F₁(x)
F₁(x) -> F₁(f₁(x))

The TRS R consists of the following rules:

f₁(x) -> f₁(f₁(x))

The set Q consists of the following terms:

f₁(x0)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F₁(x) -> F₁(x)
F₁(x) -> F₁(f₁(x))

The TRS R consists of the following rules:

f₁(x) -> f₁(f₁(x))

The set Q consists of the following terms:

f₁(x0)

We have to consider all minimal (P,Q,R)-chains.